Independence-friendly cylindric set algebras
نویسنده
چکیده
Independence-friendly logic is a conservative extension of first-order logic that has the same expressive power as existential second-order logic. In her Ph.D. thesis, Dechesne introduces a variant of independence-friendly logic called IFG logic. We attempt to algebraize IFG logic in the same way that Boolean algebra is the algebra of propositional logic and cylindric algebra is the algebra of first-order logic. We define independence-friendly cylindric set algebras and prove two main results. First, every independence-friendly cylindric set algebra over a structure has an underlying Kleene algebra. Moreover, the class of such underlying Kleene algebras generates the variety of all Kleene algebras. Hence the equational theory of the class of Kleene algebras that underly an independence-friendly cylindric set algebra is finitely axiomatizable. Second, every onedimensional independence-friendly cylindric set algebra over a structure has an underlying monadic Kleene algebra. However, the class of such underlying monadic Kleene algebras does not generate the variety of all monadic Kleene algebras. Finally, we offer a conjecture about which subvariety of monadic Kleene algebras the class of such monadic Kleene algebras does generate.
منابع مشابه
ar X iv : 0 80 2 . 21 28 v 1 [ m at h . L O ] 1 5 Fe b 20 08 Perfect IFG - formulas
IFG logic [1] is a variant of the independence-friendly logic of Hintikka and Sandu [3, 2]. We answer the question: " Which IFG-formulas are equivalent to ordinary first-order formulas? " We use the answer to show that the ordinary cylindric set algebra over a structure can be embedded into a reduct of the IFG-cylindric set algebra over the structure.
متن کاملA non representable infinite dimensional quasi-polyadic equality algebra with a representable cylindric reduct
We construct an infinite dimensional quasi-polyadic equality algebra A such that its cylindric reduct is representable, while A itself is not representable. 1 The most well known generic examples of algebraizations of first order logic are Tarski’s cylindric algebras (CA) and Halmos’ polyadic equality algebras (PEA). The theory of cylindric algebras is well developed in the treatise [10], [11],...
متن کاملA Note on Cylindric Algebras
If two atomic cylindric set algebras of finite dimension > 1 are isomorphic, then base-minimality does not imply that they are lower-base isomorphic. This contrasts the case of boolean algebras. Mathematics Subject Classification: Primary 03G15, Secondary 03C05, 03C40
متن کاملOn Finite Axiomatizability of Expansions of Cylindric Algebras
We study expansions of (representable) cylindric algebras ( ) ω CA R that are reducts of polyadic equality algebras. The question we adress is: Can we add finitely many substitutions, so that in the expanded language of , ω CA there is a finite set of quantifier free formulas that force representability of the cylindric reduct of algebras satisfying them. A refinement of a known positive soluti...
متن کاملWeakly higher order cylindric algebras and finite axiomatization of the representables
We show that the variety of n-dimensional weakly higher order cylindric algebras, introduced in Németi [9], [8], is finitely axiomatizable when n > 2. Our result implies that in certain non-well-founded set theories the finitization problem of algebraic logic admits a positive solution; and it shows that this variety is a good candidate for being the cylindric algebra theoretic counterpart of T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 17 شماره
صفحات -
تاریخ انتشار 2009